- Notifications
You must be signed in to change notification settings - Fork 5.8k
/
Copy path290. Word Pattern_test.go
58 lines (46 loc) · 855 Bytes
/
290. Word Pattern_test.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
package leetcode
import (
"fmt"
"testing"
)
typequestion290struct {
para290
ans290
}
// para 是参数
// one 代表第一个参数
typepara290struct {
onestring
twostring
}
// ans 是答案
// one 代表第一个答案
typeans290struct {
onebool
}
funcTest_Problem290(t*testing.T) {
qs:= []question290{
{
para290{"abba", "dog cat cat dog"},
ans290{true},
},
{
para290{"abba", "dog cat cat fish"},
ans290{false},
},
{
para290{"aaaa", "dog cat cat dog"},
ans290{false},
},
{
para290{"abba", "dog dog dog dog"},
ans290{false},
},
}
fmt.Printf("------------------------Leetcode Problem 290------------------------\n")
for_, q:=rangeqs {
_, p:=q.ans290, q.para290
fmt.Printf("【input】:%v 【output】:%v\n", p, wordPattern(p.one, p.two))
}
fmt.Printf("\n\n\n")
}